Orthogonal Rational Functions with real coefficients and semiseparable matrices
نویسندگان
چکیده
When one wants to use Orthogonal Rational Functions (ORFs) in system identification or control theory, it is important to be able to avoid complex calculations. In this paper we study ORFs whose numerator and denominator polynomial have real coefficients. These ORFs with real coefficients (RORFs) appear when the poles and the interpolation points appear in complex conjugate pairs, which is a natural condition. Further we deduce that there is a strong connection between RORFs and semiseparable matrices.
منابع مشابه
Rational Gauss Quadrature
The existence of (standard) Gauss quadrature rules with respect to a nonnegative measure dμ with support on the real axis easily can be shown with the aid of orthogonal polynomials with respect to this measure. Efficient algorithms for computing the nodes and weights of an n-point Gauss rule use the n × n symmetric tridiagonal matrix determined by the recursion coefficients for the first n orth...
متن کاملA QR-method for computing the singular values via semiseparable matrices
A QR–method for computing the singular values via semiseparable matrices. Abstract The standard procedure to compute the singular value decomposition of a dense matrix, first reduces it into a bidiagonal one by means of orthogonal transformations. Once the bidiagonal matrix has been computed, the QR–method is applied to reduce the latter matrix into a diagonal one. In this paper we propose a ne...
متن کاملAn implicit QR algorithm for semiseparable matrices to compute the eigendecomposition of symmetric matrices
The QR algorithm is one of the classical methods to compute the eigendecomposition of a matrix. If it is applied on a dense n×n matrix, this algorithm requires O(n3) operations per iteration step. To reduce this complexity for a symmetric matrix to O(n), the original matrix is £rst reduced to tridiagonal form using orthogonal similarity transformations. In the report [Van Barel, Vandebril, Mast...
متن کاملOn Computing the Eigenvectors of Symmetric Tridiagonal and Semiseparable Matrices
A real symmetric matrix of order n has a full set of orthogonal eigenvectors. The most used approach to compute the spectrum of such matrices reduces first the dense symmetric matrix into a symmetric structured one, i.e., either a tridiagonal matrix [2, 3] or a semiseparable matrix [4]. This step is accomplished in O(n) operations. Once the latter symmetric structured matrix is available, its s...
متن کاملComputing the rank revealing factorization of symmetric matrices by the semiseparable reduction
An algorithm for reducing a symmetric dense matrix into a symmetric semiseparable one by orthogonal similarity transformations and an efficient implementation of the QR–method for symmetric semiseparable matrices have been recently proposed. In this paper, exploiting the properties of the latter algorithms, an algorithm for computing the rank revealing factorization of symmetric matrices is con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Computational Applied Mathematics
دوره 233 شماره
صفحات -
تاریخ انتشار 2010